A Survey on Using Kolmogorov Complexity in Cybersecurity
نویسندگان
چکیده
منابع مشابه
A Survey on Kolmogorov Complexity
Kolmogorov complexity, which is also called algorithmic (descriptive) complexity is an object, such as a piece of text, to measure the computational resources needed, which are mostly the length of the shortest binary program to specify an object. Strings whose Kolmogorov complexity is small relative to the string’s size are not considered to be complex and easy to use a short program to specif...
متن کاملKolmogorov Complexity: a survey
What follows is a survey of the field of Kolmogorov complexity. Kolmogorov complexity, named after the mathematician Andrej Nikolaevič Kolmogorov, is a measure of the algorithmic complexity of a certain object (represented as a string of symbols) in terms of how hard it is to describe it. This measure dispenses with the need to know the probability distribution that rules a certain object (in g...
متن کاملA Survey on Complexity of Integrity Parameter
Many graph theoretical parameters have been used to describe the vulnerability of communication networks, including toughness, binding number, rate of disruption, neighbor-connectivity, integrity, mean integrity, edgeconnectivity vector, l-connectivity and tenacity. In this paper we discuss Integrity and its properties in vulnerability calculation. The integrity of a graph G, I(G), is defined t...
متن کاملLower Bounds Using Kolmogorov Complexity
In this paper, we survey a few recent applications of Kolmogorov complexity to lower bounds in several models of computation. We consider KI complexity of Boolean functions, which gives the complexity of finding a bit where inputs differ, for pairs of inputs that map to different function values. This measure and variants thereof were shown to imply lower bounds for quantum and randomized decis...
متن کاملOptimal Representation in Average Using Kolmogorov Complexity
One knows from the Algorithmic Complexity Theory ’ [2-5,8, 141 that a word is incompressible on average. For words of pattern xm, it is natural to believe that providing x and m is an optimal average representation. On the contrary, for words like x @ y (i.e., the bit to bit x or between x and y), providing n and y is not an optimal description on average. In this work, we sketch a theory of av...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Entropy
سال: 2019
ISSN: 1099-4300
DOI: 10.3390/e21121196